successive over-relaxation

См. также в других словарях:

• Successive over-relaxation — (SOR) is a numerical method used to speed up convergence of the Gauss–Seidel method for solving a linear system of equations. A similar method can be used for any slowly converging iterative process. It was devised simultaneously by David M.… …   Wikipedia

• Relaxation (approximation) — In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby problem that is easier to solve. A solution of the relaxed problem provides information about… …   Wikipedia

• Relaxation method — In numerical mathematics, the relaxation method is a method for obtaining numerical approximations to the solutions of systems of equations, including certain types of elliptic partial differential equations, in particular Laplace s equation and… …   Wikipedia

• Méthode de surrelaxation successive — En analyse numérique, la méthode de surrelaxation successive est une variante de la méthode de Gauss Seidel pour résoudre un système d équations linéaires. La convergence de cet algorithme est généralement plus rapide. Une approche similaire peut …   Wikipédia en Français

• SOR — Successive Over Relaxation (mathematics) Contributor: CASI …   NASA Acronyms

• David M. Young, Jr. — David M. Young, Jr. Born October 20, 1923(1923 10 20) Quincy, Massachusetts …   Wikipedia

• List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

• Preconditioner — In linear algebra and numerical analysis, a preconditioner P of a matrix A is a matrix such that P −1 A has a smaller condition number than A .Preconditioners are useful when using an iterative method to solve a large, sparse linear system : Ax …   Wikipedia

• Iterative method — In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. A specific implementation of an iterative method, including the termination… …   Wikipedia

• List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

• SOR-Verfahren — Das „Successive Over Relaxation“ Verfahren oder SOR Verfahren ist ein Algorithmus der numerischen Mathematik zur näherungsweisen Lösung von linearen Gleichungssystemen. Es ist, wie das Gauß Seidel Verfahren und das Jacobi Verfahren, ein… …   Deutsch Wikipedia